Reasoning with limited resources: An LDS-based approach

نویسندگان

  • Mikael Asker
  • Jacek Malec
چکیده

Reasoning with limited computational resources (such as time or memory) is an important problem, in particular in knowledge-intensive embedded systems. Classical logic is usually considered inapropriate for this purpose as no guarantees regarding deadlines can be made. One of the more interesting approaches to address this problem is built around the concept of active logics. Although a step in the right direction, active logics still do not offer the ultimate solution. Our work is based on the assumption that Labelled Deductive Systems offer appropriate metamathematical methodology to study the problem. As a first step, we have reformulated a pair of systems, namely the step logic and the memory model proposed by Elgot-Drapkin, as Labelled Deductive Systems. This paper presents our motivation behind this project and presents in some detail the first system.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On reasoning and planning in real-time: An LDS-based approach

Reasoning with limited computational resources (such as time or memory) is an important problem, in particular in cognitive embedded systems. Classical logic is usually considered inappropriate for this purpose as no guarantees regarding deadlines can be made. One of the more interesting approaches to address this problem is built around the concept of active logics. Although a step in the righ...

متن کامل

Improving Agent Performance for Multi-Resource Negotiation Using Learning Automata and Case-Based Reasoning

In electronic commerce markets, agents often should acquire multiple resources to fulfil a high-level task. In order to attain such resources they need to compete with each other. In multi-agent environments, in which competition is involved, negotiation would be an interaction between agents in order to reach an agreement on resource allocation and to be coordinated with each other. In recent ...

متن کامل

INTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING

Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...

متن کامل

Towards Computational Models of Natural Argument using Labelled Deductive Systems

During the last decade computational models of argument have emerged as a successful approach to the formalization of commonsense reasoning, encompassing many other alternative formalisms. Common elements can be identified in such frameworks along with a number of particular features which make it difficult to compare them with each other from a logical viewpoint. This paper presents a unifying...

متن کامل

A Framework for Combining Defeasible Argumentation with Labeled Deduction

In the last years, there has been an increasing demand of a variety of logical systems, prompted mostly by applications of logic in AI and other related areas. Labeled Deductive Systems (LDS) were developed as a flexible methodology to formalize such a kind of complex logical systems. Defeasible argumentation has proven to be a successful approach to formalizing commonsense reasoning, encompass...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003